Bucket Hashing and Its Application to Fast Message Authentication
نویسندگان
چکیده
منابع مشابه
Bucket Hashing and its Application
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman{Carter authentication, this style of hash function provides a fast approach for software message...
متن کاملconstruction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
UMAC: Message Authentication Code using Universal Hashing
Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This specification describes how to generate an authentication tag using the UMAC message authentication algorithm. UMAC is designed to be very fast to compute in software on contemporary uniprocessors. Measured spe...
متن کاملHMAC: Keyed-Hashing for Message Authentication
This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key....
متن کاملBoosting Merkle-Damgård Hashing for Message Authentication
This paper presents a novel mode of operation of compression functions, intended for dedicated use as a message authentication code (MAC.) The new approach is faster than the well-known MerkleDamg̊ard iteration; more precisely, it is (1 + c/b)-times as fast as the classical Merkle-Damg̊ard hashing when applied to a compression function h : {0, 1}c+b → {0, 1}c. Our construction provides a single-k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 1999
ISSN: 0933-2790,1432-1378
DOI: 10.1007/pl00003822